2 Mixing of Riffle Shuffle via Strong Stationary Times

نویسندگان

  • Constantinos Daskalakis
  • Alan Deckelbaum
چکیده

1.2 Relating the inverse and standard shuffles We now need to relate ∆(t) to ∆(t). We will do this by taking a more general view of shuffles. We will think of a shuffle as a random walk on the symmetric group Sn. The walk is defined by a set of generators G = {g1, . . . , gk} and a probability distribution P over G. (At each step of the walk, we pick a random gi according to P and apply gi to the current state.) Since each generator in G has an inverse in Sn, we see that the random walk process is doubly-stochastic. Therefore, the stationary distribution of the walk is uniform over Sn. We define the inverse shuffle by the generator set G ′ = {g−1 1 , . . . , g −1 k } with the probability distribution P ′(g−1 i ) = P (gi). Claim 1. ∆(t) = ∆(t).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rapid mixing of dealer shuffles and clumpy shuffles

A famous result of Bayer and Diaconis [2] is that the Gilbert-Shannon-Reeds (GSR) model for the riffle shuffle of n cards mixes in 3 2 log2 n steps and that for 52 cards about 7 shuffles suffices to mix the deck. In this paper, we study variants of the GSR shuffle that have been proposed to model more realistically how people actually shuffle a deck of cards. The clumpy riffle shuffle and deale...

متن کامل

Finite Markov Chains and the Top-to-random Shuffle

In this paper, I present an introduction to Markov chains, basic tools to analyze them, and an example, the top-to-random shuffle. I cover the existence and uniqueness of stationary distributions, the Convergence Theorem, total variation distance, mixing time, and strong stationary times. Using these tools, I show that the top-to-random shuffle on a deck of n cards mixes the deck in approximate...

متن کامل

Riffle shuffles of decks with repeated cards

By a well-known result of Bayer and Diaconis, the maximum entropy model of the common riffle shuffle implies that the number of riffle shuffles necessary to mix a standard deck of 52 cards is either 7 or 11 — with the former number applying when the metric used to define mixing is the total variation distance and the later when it is the separation distance. This and other related results assum...

متن کامل

Randomization Time for the Overhand Shuffle

1. THE OVERHAND SHUFFLE (~o The two most common methods of shuffling a deck of playing cards are the riffle shuffle and the overhand shuffle. The riffle shuffle is performed by splitting the deck into two halves and interlacing them. Aldous and Diaconis have shown in Ref. I that approximately 2 log N riffle shuffles suffices to randomize a deck (the meaning of this will be made more precise bel...

متن کامل

An Efficient Communication System With Strong Anonymity

Existing anonymity systems sacrifice anonymity for efficient communication or vice-versa. Onion-routing achieves low latency, high bandwidth, and scalable anonymous communication, but is susceptible to traffic analysis attacks. Designs based on DC-Nets, on the other hand, protect the users against traffic analysis attacks, but sacrifice bandwidth. Verifiable mixnets maintain strong anonymity wi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011